Termination w.r.t. Q of the following Term Rewriting System could be proven:
Q restricted rewrite system:
The TRS R consists of the following rules:
f(f(a)) → f(g(n__f(a)))
f(X) → n__f(X)
activate(n__f(X)) → f(X)
activate(X) → X
Q is empty.
↳ QTRS
↳ DirectTerminationProof
Q restricted rewrite system:
The TRS R consists of the following rules:
f(f(a)) → f(g(n__f(a)))
f(X) → n__f(X)
activate(n__f(X)) → f(X)
activate(X) → X
Q is empty.
We use [27] with the following order to prove termination.
Knuth-Bendix order [24] with precedence:trivial
and weight map:
activate_1=3
f_1=3
a=1
g_1=1
n__f_1=1